Piecewise Linear AD via Source Transformation
نویسندگان
چکیده
y m i = vl i for i = 0, . . . ,m 1 Extraction . Here, x 2 X ✓ R denotes a vector of input variables, y = y(x) 2 R the corresponding output variables, and ' some smooth intermediate assignments from a library ⌘ +, , ⇤, /, p ·, exp, sin, cos, . . . . However, the smoothness assumption is violated in most real applications. For example, the evaluation routines of many physical applications contain nonsmooth expressions such as the absolute value, the maximum, and/or the minimum function, in order to avoid unrealistic quantities. In this case, the standard di↵erentiation rules do not necessarily apply any more. Thus, the derivatives provided by standard AD tools become unreliable since they are based on the chain rule. Moreover, the simpler models are questionable even if the derivatives are evaluated at points x 2 R where the function is di↵erentiable, since they do not take nearby kinks or nonsmoothness into account. A remedy for this situation was recently proposed in [1], where the author presents a method to compute (directional) piecewise linear models of the original abs-factorable function instead of a simple linearization. The piecewise linearization y = F (x; x), F : R ⇥R ! R, at a point x 2 R for a directional increment x 2 R represents the function in a more appropriate way and can be derived by a minor modification of the original code. Similar to the standard forward mode, the idea is based on defining an extended evaluation routine using the propagation rules
منابع مشابه
Close interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program
The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...
متن کاملOptimizing direct response in Internet display advertising
Internet display advertising has grown into a multi-billion dollar a year global industry and direct response campaigns account for about three-quarters of all Internet display advertising. In such campaigns, advertisers reach out to a target audience via some form of a visual advertisement (hereinafter also called ‘‘ad’’) to maximize short-term sales revenue. In this study, we formulate an adv...
متن کاملSpreading Sequences Generated Using Asymmetrical Integer-Number Maps
Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed...
متن کاملAdaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection
This article is devoted to nonlinear approximation and estimation via piecewise polynomials built on partitions into dyadic rectangles. The approximation rate is studied over possibly inhomogeneous and anisotropic smoothness classes that contain Besov classes. Highlighting the interest of such a result in statistics, adaptation in the minimax sense to both inhomogeneity and anisotropy of a rela...
متن کاملAutomatic Sparsity Detection Implemented as a Source-to-Source Transformation
An implementation of Automatic Sparsity Detection (ASD) as a new source-to-source transformation is presented. Given a code for evaluation of a function, ASD generates code to evaluate the sparsity pattern of the function’s Jacobian by operations on bit-vectors. Similar to Automatic Differentiation (AD), there are forward and reverse modes of ASD. As ASD code has significantly fewer required va...
متن کامل